1 Obtaining O ( N − 2 + ǫ ) Convergence for Lattice Quadrature Rules ⋆ Fred
نویسنده
چکیده
Abstract. Good lattice quadrature rules are known to have O(N) convergence for periodic integrands with sufficient smoothness. Here it is shown that applying the baker’s transformation to lattice rules gives O(N) convergence for nonperiodic integrands with sufficient smoothness. This approach is philosophically and practically different than making a periodizing transformation of the integrand, and this difference is explained.
منابع مشابه
The kink phenomenon in Fejér and Clenshaw-Curtis quadrature
The Fejér and Clenshaw–Curtis rules for numerical integration exhibit a curious phenomenon when applied to certain analytic functions. When N (the number of points in the integration rule) increases, the error does not decay to zero evenly but does so in two distinct stages. For N less than a critical value, the error behaves like O( −2N ), where is a constant greater than 1. For these values o...
متن کاملOn the Convergence Rates of Gauss and Clenshaw-Curtis Quadrature for Functions of Limited Regularity
We study the optimal general rate of convergence of the n-point quadrature rules of Gauss and Clenshaw–Curtis when applied to functions of limited regularity: if the Chebyshev coefficients decay at a rate O(n−s−1) for some s > 0, Clenshaw–Curtis and Gauss quadrature inherit exactly this rate. The proof (for Gauss, if 0 < s < 2, there is numerical evidence only) is based on work of Curtis, Johns...
متن کاملA generalized discrepancy and quadrature error bound
An error bound for multidimensional quadrature is derived that includes the Koksma-Hlawka inequality as a special case. This error bound takes the form of a product of two terms. One term, which depends only on the integrand, is defined as a generalized variation. The other term, which depends only on the quadrature rule, is defined as a generalized discrepancy. The generalized discrepancy is a...
متن کاملThe Analysis of Vertex Modified Lattice Rules in a Non-Periodic Sobolev Space
Abstract In a series of papers, in 1993, 1994 & 1996 (see [7, 8, 9]), Ian Sloan together with Harald Niederreiter introduced a modification of lattice rules for non-periodic functions, called “vertex modified lattice rules”, and a particular breed called “optimal vertex modified lattice rules”. These are like standard lattice rules but they distribute the point at the origin to all corners of t...
متن کاملConstructing Embedded Lattice Rules for Multivariate Integration
Lattice rules are a family of equal-weight cubature formulas for approximating highdimensional integrals. By now it is well established that good generating vectors for lattice rules having n points can be constructed component-by-component for integrands belonging to certain weighted function spaces, and that they can achieve the optimal rate of convergence. Although the lattice rules construc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007